Gated Multi-task Learning for QoS-aware Service Recommendation

نویسندگان

چکیده

Abstract In the ever-increasing diversity of cloud environment, recommendation web service-related applications based on service quality is a basic tasks that both providers and developers are very interested in. A key challenge how to get personalized accurate QoS values services from multi-source information users/services. addition, complex contexts multi-tasking attributes also make collaborative prediction difficult meet. Inspired by progress multi-task deep learning, this paper proposes new framework called gated expert network (MGEN), which gating mechanism learning. The MGEN consists three parts: expert-based context-source feature extraction, interaction learning fusion. First, multiple networks used capture latent representation in raw data services, including implicit features matrix explicit descriptions. process, several independent experts extract different dimensions. Second, output embedding transmitted each task layer through weights, global local high-order interactions. Third, interactive fused splicing, then fed back module for final recommendation. Results comparative experiment demonstrate proposed significantly outperforms state-of-the-art models recommendation, where various sequences effectively extracted. performs well independently modeling task.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

QoS-based Web Service Recommendation using Popular-dependent Collaborative Filtering

Since, most of the organizations present their services electronically, the number of functionally-equivalent web services is increasing as well as the number of users that employ those web services. Consequently, plenty of information is generated by the users and the web services that lead to the users be in trouble in finding their appropriate web services. Therefore, it is required to provi...

متن کامل

Semantic Constraint and QoS-Aware Large-Scale Web Service Composition

Service-oriented architecture facilitates the running time of interactions by using business integration on the networks. Currently, web services are considered as the best option to provide Internet services. Due to an increasing number of Web users and the complexity of users’ queries, simple and atomic services are not able to meet the needs of users; and to provide complex services, it requ...

متن کامل

Multi-Path QoS-Aware Service Composition

The goal of QoS-aware service composition is to generate optimal composite services that satisfy QoS requirements defined by clients. However, when compositions contain multiple execution paths, it is difficult to generate a solution that simultaneously optimizes all the execution paths involved in the composition at the same time, while meets global QoS constraints imposed by clients. Furtherm...

متن کامل

Temporal-Aware QoS-Based Service Recommendation using Tensor Decomposition

The number of services on the Internet is growing rapidly. Thus, the problem of selecting proper services for most users becomes serious and service recommendation is widely needed. Besides functions, QoS information is also an important factor to be considered when making recommendations to users. However, QoS changes with time. To address and solve these challenges, this paper proposes a temp...

متن کامل

Personalized QOS-Aware Web Service Recommendation Via Collaborative Filtering

Web services are integrated software components for the support of interoperable machine-tomachine interaction over a network. Web services have been widely employed for building service-oriented applications in both industry and academia in recent years. The number of publicly availableWeb services is steadily increasing on the Internet. However, this proliferation makes ithard for a user to s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of physics

سال: 2023

ISSN: ['0022-3700', '1747-3721', '0368-3508', '1747-3713']

DOI: https://doi.org/10.1088/1742-6596/2547/1/012011